Minimal Realizations of Linear Systems: The “Shortest Basis” Approach

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal realizations of linear systems: The "shortest basis" approach

Given a discrete-time linear system C, a shortest basis for C is a set of linearly independent generators for C with the least possible lengths. A basis B is a shortest basis if and only if it has the predictable span property (i.e., has the predictable delay and degree properties, and is noncatastrophic), or alternatively if and only if it has the subsystem basis property (for any interval J ,...

متن کامل

Minimal solution of fuzzy linear systems

In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.

متن کامل

On Minimal Realizations and Minimal Partial Realizations of Linear Time-Invariant Systems Subject to Point Incommensurate Delays

This paper investigates key aspects of realization and partial realization theories for linear timeinvariant systems being subject to a set of incommensurate internal and external point delays. The results are obtained based on the use of formal Laurent expansions whose coefficients are polynomial matrices of appropriate orders and which are also appropriately related to truncated and infinite ...

متن کامل

Realizations of linear control systems

Linear constant-coefficients control systems with output on arbitrary time scales are studied. Kalman criteria of controllability and observability are extended to such systems. The main problem is to find criteria for an abstract input/output map to have a realization as a system on the time scale. Two different characterizations of realizability are proved. They extend the classical results o...

متن کامل

Computation of Minimal Realizations of Periodic Systems

We propose balancing related numerically reliable methods to compute minimal realizations of linear periodic systems with time-varying dimensions. The first method belongs to the family of square-root methods with guaranteed enhanced computational accuracy and can be used to compute balanced minimal order realizations. An alternative balancing-free square-root method has the advantage of a pote...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2011

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2010.2094811